The domino shuffling algorithm and Anisotropic KPZ stochastic growth
نویسندگان
چکیده
The domino-shuffling algorithm can be seen as a stochastic process describing the irreversible growth of $(2+1)$-dimensional discrete interface. Its stationary speed $v_{\mathtt w}(\rho)$ depends on average interface slope $\rho$, well edge weights $\mathtt w$, that are assumed to periodic in space. We show this model belongs Anisotropic KPZ class: one has $\det [D^2 v_{\mathtt w}(\rho)]<0$ and height fluctuations grow at most logarithmically time. Moreover, we prove $D is discontinuous each (finitely many) smooth (or "gaseous") slopes $\rho$; these slopes, do not diverge time grows. For special case spatially $2-$periodic weights, analogous results have been recently proven Chhita-Toninelli (2018) via an explicit computation w}(\rho)$. In general case, such out reach; instead, our proof goes through relation between limit shape domino tilings Aztec diamond.
منابع مشابه
On the Shuffling Algorithm for Domino Tilings∗
We study the dynamics of a certain discrete model of interacting interlaced particles that comes from the so called shuffling algorithm for sampling a random tiling of an Aztec diamond. It turns out that the transition probabilities have a particularly convenient determinantal form. An analogous formula in a continuous setting has recently been obtained by Jon Warren studying certain model of i...
متن کاملGeneralized domino-shuffling
The problem of counting tilings of a plane region using specified tiles can often be recast as the problem of counting (perfect) matchings of some subgraph of an Aztec diamond graph An, or more generally calculating the sum of the weights of all the matchings, where the weight of a matching is equal to the product of the (pre-assigned) weights of the constituent edges. This article presents eff...
متن کاملA Note on Domino Shuffling
We present a variation of James Propp’s generalized domino shuffling, which provides an efficient way to obtain perfect matchings of weighted Aztec diamonds. Our modification is specially tailored to deal with cases when some of the weights are zero. This allows us to tile efficiently a large class of planar graphs, by embedding them in a large enough Aztec diamond. We also give a sufficient co...
متن کاملDomino Shuffling on Novak Half-Hexagons and Aztec Half-Diamonds
We explore the connections between the well-studied Aztec Diamond graphs and a new family of graphs called the Half-Hexagons, discovered by Jonathan Novak. In particular, both families of graphs have very simple domino shuffling algorithms, which turn out to be intimately related. This connection allows us to prove an “arctic parabola” theorem for the Half-Hexagons as a corollary of the Arctic ...
متن کاملAnisotropic KPZ growth in 2 + 1 dimensions : fluctuations and covariance structure
In [5] we studied an interacting particle system which can be also interpreted as a stochastic growth model. This model belongs to the anisotropic KPZ class in 2 + 1 dimensions. In this paper we present the results that are relevant from the perspective of stochastic growth models, in particular: (a) the surface fluctuations are asymptotically Gaussian on a √ ln t scale and (b) the correlation ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Annales Henri Lebesgue
سال: 2021
ISSN: ['2644-9463']
DOI: https://doi.org/10.5802/ahl.95